-
1 semidefinite problem
Большой англо-русский и русско-английский словарь > semidefinite problem
-
2 semidefinite problem
Математика: полуопределённая задача -
3 semidefinite problem
English-Russian scientific dictionary > semidefinite problem
-
4 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
5 полуопределенная задача
semidefinite problem мат.Русско-английский научно-технический словарь Масловского > полуопределенная задача
-
6 полуопределенная задача
Большой англо-русский и русско-английский словарь > полуопределенная задача
-
7 полуопределённая задача
Mathematics: semidefinite problemУниверсальный русско-английский словарь > полуопределённая задача
См. также в других словарях:
Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… … Wikipedia
Semidefinite Optimierung — In der Semidefiniten Programmierung (SDP, auch Semidefinite Optimierung) werden Optimierungsprobleme untersucht, deren Variablen keine Vektoren, sondern symmetrische Matrizen sind. Als Nebenbedingung wird verlangt, dass diese Matrizen positiv… … Deutsch Wikipedia
Semidefinite Programmierung — In der Semidefiniten Programmierung (SDP, auch Semidefinite Optimierung) werden Optimierungsprobleme untersucht, deren Variablen keine Vektoren, sondern symmetrische Matrizen sind. Als Nebenbedingung wird verlangt, dass diese Matrizen positiv… … Deutsch Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Trigonometric moment problem — In mathematics, the trigonometric moment problem is formulated as follows: given a finite sequence { α 0, ... αn }, does there exist a positive Borel measure mu; on the interval [0, 2 pi; ] such that:alpha k = frac{1}{2 pi}int 0 ^{2 pi} e^{… … Wikipedia
Hilbert's seventeenth problem — is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. It entails expression of definite rational functions as quotients of sums of squares. Original Hilbert s question was:Given a multivariate… … Wikipedia
Kissing number problem — In geometry, the kissing number is the maximum number of spheres of radius 1 that can simultaneously touch the unit sphere in n dimensional Euclidean space. The kissing number problem seeks the kissing number as a function of n .Known kissing… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Conic optimization — is a subfield of convex optimization that studies a class of structured convex optimization problems called conic optimization problems. A conic optimization problem consists of minimizing a convex function over the intersection of an affine… … Wikipedia
Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find … Wikipedia
Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… … Wikipedia